TT-cross approximation for multidimensional arrays

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

TT-cross approximation for multidimensional arrays

Article history: Received 19 July 2009 Accepted 27 July 2009 Available online 21 August 2009 Submitted by V. Sergeichuk AMS classification: 15A12 65F10 65F15

متن کامل

Multigrid Accelerated Tensor Approximation of Function Related Multidimensional Arrays

In this paper, we describe and analyze a novel tensor approximation method for discretized multidimensional functions and operators in Rd, based on the idea of multigrid acceleration. The approach stands on successive reiterations of the orthogonal Tucker tensor approximation on a sequence of nested refined grids. On the one hand, it provides a good initial guess for the nonlinear iterations to...

متن کامل

Fast Multidimensional Convolution in Low-rank Formats via Cross Approximation

We propose new cross-conv algorithm for approximate computation of convolution in different low-rank tensor formats (tensor train, Tucker, Hierarchical Tucker). It has better complexity with respect to the tensor rank than previous approaches. The new algorithm has a high potential impact in different applications. The key idea is based on applying cross approximation in the “frequency domain”,...

متن کامل

Multidimensional Arrays for Warehousing Data on Clouds

Data warehouses and OLAP systems are business intelligence technologies. They allow decision-makers to analyze on the fly huge volumes of data represented according to the multidimensional model. Cloud computing on the impulse of ICT majors like Google, Microsoft and Amazon, has recently focused the attention. OLAP querying and data warehousing in such a context consists in a major issue. Indee...

متن کامل

A Differential Evolution Algorithm for Multidimensional Arrays

In this paper, we propose a differential evolution (DE) algorithm which aims to optimize a system whose parameters form a multidimensional array. Determination of the optimal demixing matrix in a blind signal separation problem can be considered as an example of this type of system. Since the DE algorithm performs only on column vectors, it can be used after the multidimensional array is transf...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2010

ISSN: 0024-3795

DOI: 10.1016/j.laa.2009.07.024